Total belief theorem and conditional belief functions
نویسندگان
چکیده
منابع مشابه
Geometric conditional belief functions
In this paper we study the problem of conditioning a belief function b with respect to an event A by geometrically projecting such belief function onto the simplex associated with A in the simplex of all belief functions. Two different such simplices can be defined, as each belief function can be represented as the vector of its basic probability values or the vector of its belief values. We sh...
متن کاملThe Total Belief Theorem
In this paper, motivated by the treatment of conditional constraints in the data association problem, we state and prove the generalisation of the law of total probability to belief functions, as finite random sets. Our results apply to the case in which Dempster’s conditioning is employed. We show that the solution to the resulting total belief problem is in general not unique, whereas it is u...
متن کاملGeometric conditional belief functions in the belief space
In this paper we study the problem of conditioning a belief function (b.f.) b with respect to an event A by geometrically projecting such belief function onto the simplex associated with A in the space of all belief functions. Defining geometric conditional b.f.s by minimizing Lp distances between b and the conditioning simplex in such “belief” space (rather than in the “mass” space) produces c...
متن کاملEvidential Reasoning with Conditional Belief Functions
In the existing evidential networks with belief functions, the relations among the variables are always represented by joint belief functions on the product space of the involved variables. In this paper, we use conditional belief functions to represent such relations in the network and show some relations of these two kinds of representations. We also present a propagation algorithm for such n...
متن کاملA Central Limit Theorem for Belief Functions
The purpose of this Note is to prove a form of CLT (Theorem 1.4) that is used in Epstein and Seo (2011). More general central limit results and other applications will follow in later drafts. Let S = fB;Ng and K (S) = ffBg; fNg; fB;Ngg the set of nonempty subsets of S. Denote by s1 = (s1; s2; :::) the generic element of S1 and by n (s1) the empirical frequency of the outcome B in the rst n exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Intelligent Systems
سال: 2018
ISSN: 0884-8173
DOI: 10.1002/int.22031